Using BOINC Desktop Grid to Solve Large Scale SAT Problems

نویسندگان

  • Mikhail Posypkin
  • Alexander Semenov
  • Oleg Zaikin
چکیده

Many practically important combinatorial problems can be efficiently reduced to a problem of Boolean satisfiability (SAT). Therefore, the implementation of distributed algorithms for solving SAT problems is of great importance. In this article we describe a technology for organizing desktop grid, which is meant for solving SAT problems. This technology was implemented in the form of a volunteer computing project SAT@home based on a popular BOINC platform.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Implementation of Branch-and-Bound Method on Desktop Grids

The Berkeley Open Infrastructure for Network Computing (BOINC) is an opensource middleware system for volunteer and desktop grid computing. In this paper, we propose BNBTEST, a BOINC version of the distributed branch-andbound method. The crucial issues of the distributed branch-and-bound method are traversing the search tree and loading the balance. We developed a subtask packaging method and t...

متن کامل

Association Rules Extraction from Big Data Using BOINC-based Enterprise Desktop Grid

The paper describes an approach to association rules extraction from huge data sets using BOINC-based Enterprise Desktop Grid. An algorithm of data analysis and a native BOINC-based application are presented. Several experiments with the aim of validation and performance evaluation of the algorithm implementation were performed. The results of the experiments show that the approach is promising...

متن کامل

Association Rules Mining using BOINC–based Enterprise Desktop Grid

The paper is devoted to association rules mining using BOINC– project based on Enterprise Desktop Grid. A high-level algorithm description is given. A BOINC–based application is developed and validated. Several experiments with the aim of performance evaluation are performed. Ways to further develop the approach are described.

متن کامل

Dynamic Scheduling of Independent Tasks with a Budget Constraint on a Desktop Grid

In an Internet desktop grid, the computing power may be leveraged by providing economic incentive for computer owners. Using batch mode scheduling heuristics, such as MinMin, MaxMin or Sufferage, this paper describes an algorithm that performs independent task scheduling on a large scale heterogeneous system, with a budget constraint. Under the restriction of never exceeding a periodically refr...

متن کامل

Integration of Everest Platform with BOINC-based Desktop Grids

Desktop grids is an important class of distributed computing infrastructures (DCIs) used for solving complex scientific problems. The inherent complexity of DCIs and used technologies limit the wide adoption of distributed computing in practice. Everest is a web-based distributed computing platform that uses service-oriented approach and cloud computing models to solve this problem. This paper ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Science (AGH)

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2012